package 分割等和子集;

import java.util.Scanner;

public class Main {

    public static void main(String[] args) {
        Scanner in = new Scanner(System.in);
        int n = in.nextInt();
        int sum = 0;
        int[] a = new int[n + 1];
        for (int i = 1; i <= n; i++) {
            a[i] = in.nextInt();
            sum += a[i];
        }
        if (sum % 2 == 1) {
            System.out.println(false);
            return;
        }
        boolean[] f = new boolean[sum / 2 + 1];
        f[0] = true;
        for (int i = 0; i < n; i++) {
            for (int j = sum / 2; j >= a[i]; j--) {
                f[j] = f[j] || f[j - a[i]];
            }
        }
        System.out.println(f[sum / 2]);
    }
}
